Two-step Bdf Time Discretisation of Nonlinear Evolution Problems Governed by Monotone Operators with Strongly Continuous Perturbations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-step Bdf Time Discretisation of Nonlinear Evolution Problems Governed by Monotone Operators with Stringly Continuous Peryurbations

The time discretisation of the initial-value problem for a first-order evolution equation by the two-step backward differentiation formula (BDF) on a uniform grid is analysed. The evolution equation is governed by a time-dependent monotone operator that might be perturbed by a time-dependent strongly continuous operator. Well-posedness of the numerical scheme, a priori estimates, convergence of...

متن کامل

Convergence of the variable two - step BDF time discretisation of nonlinear evolution problems governed by a monotone potential operator

The initial-value problem for a first-order evolution equation is discretised in time by means of the two-step backward differentiation formula (BDF) on a variable time grid. The evolution equation is governed by a monotone and coercive potential operator. On a suitable sequence of time grids, the piecewise constant interpolation and a piecewise linear prolongation of the time discrete solution...

متن کامل

Stiffly accurate Runge-Kutta methods for nonlinear evolution problems governed by a monotone operator

Stiffly accurate implicit Runge–Kutta methods are studied for the time discretisation of nonlinear first-order evolution equations. The equation is supposed to be governed by a time-dependent hemicontinuous operator that is (up to a shift) monotone and coercive, and fulfills a certain growth condition. It is proven that the piecewise constant as well as the piecewise linear interpolant of the t...

متن کامل

Iterative Algorithms for Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

Consider the variational inequality V I(C, F ) of finding a point x∗ ∈ C satisfying the property 〈Fx∗, x − x∗〉 ≥ 0 for all x ∈ C, where C is a nonempty closed convex subset of a real Hilbert space H and F : C → H is a nonlinear mapping. If F is boundedly Lipschitzian and strongly monotone, then we prove that V I(C, F ) has a unique solution and iterative algorithms can be devised to approximate...

متن کامل

Hybrid Steepest-Descent Methods for Solving Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

Let H be a real Hilbert space and let F : H → H be a boundedly Lipschitzian and strongly monotone operator. We design three hybrid steepest descent algorithms for solving variational inequality VI C, F of finding a point x∗ ∈ C such that 〈Fx∗, x − x∗〉 ≥ 0, for all x ∈ C, where C is the set of fixed points of a strict pseudocontraction, or the set of common fixed points of finite strict pseudoco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Methods in Applied Mathematics

سال: 2009

ISSN: 1609-9389,1609-4840

DOI: 10.2478/cmam-2009-0003